منابع مشابه
UvA - DARE ( Digital Academic Repository ) Analysis of multi - stage open shop processing systems
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe system states. We show that it is easy to recognize system states that can be reached from the initial state (where the system is empty), but that in general it is hard to decide whether one given system state is reacha...
متن کاملPartially-Concurrent Open Shop Scheduling
The partially-concurrent open shop scheduling problem is presented. The standard open shop scheduling problem is generalized by allowing some operations to be processed concurrently. This generalization is directly motivated from a real-life timetabling project of assigning technicians to airplanes in an airplane garage. A schedule for the partially-concurrent problem is represented by a digrap...
متن کاملCat swarm optimization for solving the open shop scheduling problem
This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing applications. The cat swarm optimization algorithm was applied to solve some benchmark instances from the lit...
متن کاملGeneralized Cyclic Open Shop Scheduling and a Hybrid Algorithm
In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...
متن کاملThe cyclic compact open-shop scheduling problem
We consider a variation of the classical nonpreemptive open-shop scheduling problem. For the normal open shop, finding whether a schedule exists in T time units is NP-complete [2]. The main difference with the classical model is that we will consider so-called periodical or cyclic schedules; this means that the schedule obtained is repeated periodically. If the length of a period is k time unit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1984
ISSN: 0028-0836,1476-4687
DOI: 10.1038/312687b0